binary entropy造句

When p = \ tfrac 1 2, the binary entropy function attains its maximum value.
The entropy of a Bernoulli trial as a function of success probability, often called the "'binary entropy function "',.
If you're trying to program a computer to convert some non-binary entropy source to a bit stream, the mathematical theory of randomness extractors is way more complicated than you need.
The special case of information entropy for a random variable with two outcomes is the "'binary entropy function "', usually taken to the logarithmic base 2, thus having the shannon ( Sh ) as unit:
In information theory, the "'binary entropy function "', denoted \ operatorname H ( p ) or \ operatorname H _ \ text { b } ( p ), is defined as the entropy of a Bernoulli process with probability of success p.
It's difficult to find binary entropy in a sentence. 用binary entropy造句挺难的

From here we use the fact that the binary entropy H _ 2 ( z ) is decreasing with respect to | 1 / 2 + z | as well as the fact that H _ 2 ( 1 + \ sqrt { 1-z ^ 2 } / 2 ) is convex with respect to z to find the following inequality: